Probabilistic Models for Generating, Modelling and Matching Image Categories
نویسندگان
چکیده
In this paper we present a probabilistic and continuous framework for supervised image category modelling and matching as well as unsupervised clustering of image space into image categories. A generalized GMM-KL framework is described in which each image or image-set (category) is represented as a Gaussian mixture distribution and images (categories) are compared and matched via a probabilistic measure of similarity between distributions. Image-tocategory matching is investigated and unsupervised clustering of a random image set into visually coherent image categories is demonstrated.
منابع مشابه
Improved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملImproved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملOn Comparing Two Scenarios for Probabilistic Image Modelling
Traditional scenario of probabilistic modelling is directed at generating samples having a given probability distribution. We argue that this scenario is impracticable for image modelling and should be replaced by more reasonable alternative one. This latter tends to generate samples having probabilities in the vicinity of the probability of a given training sample. Gibbs image models with mult...
متن کاملImage Segmentation using Gaussian Mixture Model
Abstract: Stochastic models such as mixture models, graphical models, Markov random fields and hidden Markov models have key role in probabilistic data analysis. In this paper, we used Gaussian mixture model to the pixels of an image. The parameters of the model were estimated by EM-algorithm. In addition pixel labeling corresponded to each pixel of true image was made by Bayes rule. In fact,...
متن کاملImage Matching with Sift Features – a Probabilistic Approach
An image matching algorithm is presented in this paper. A set of interest points known as SIFT features are computed for a pair of images. Every keypoint has a descriptor based on histogram of magnitude and direction of gradients. These descriptors are the primary input for the image correspondence algorithm. Initial probabilities are assigned for categories (probable matches) considering a fea...
متن کامل